/**
 *Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.
 *You may assume that the array is non-empty and the majority element always exist in the array. 
 */
/**
 * @author I321035
 *
 */
package problem169_Majority_Element;